捷联式惯性导航系统误差处理技术的新进展

捷联式惯性导航系统误差处理的研究在近年来取得很大进展 ,相继出现了一些新思想、新算法、新技术。首先对捷联惯导系统误差模型的研究现状作了系统总结 ,然后对捷联式系统姿态算法和误差处理技术进行了归纳和分析 ,重点介绍了近期出现的几种新技术 ,最后提出了捷联惯导系统误差处理技术的研究方向。     

红外/雷达传感器协同跟踪算法研究

通常情况下 ,主动传感器在检测到目标之前就暴露了携带它的飞行器 ,因此 ,在作战环境下 ,限制主动检测设备的使用是必要的。被动传感器工作时具有隐蔽性 ,在现代军事跟踪系统中起着重要作用。研究了红外 /雷达的协同跟踪 ,以满足跟踪精度和隐蔽性双重要求     

Deterministic inventory lot‐size models under inflation with shortages and deterioration for fluctuating demand

In this paper, we extend the inventory lot‐size models to allow for inflation and fluctuating demand (which is more general than constant, increasing, decreasing, and log‐concave demand patterns). We prove that the optimal replenishment schedule not only exists but is also unique. Furthermore, we show that the total cost associated with the inventory system is a convex function of the number of replenishments. Hence, the search for the optimal number of replenishments is simplified to finding a local minimum. Finally, several numerical examples are provided to illustrate the results. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 144–158, 2001     

论物理化学教学内容及教学方法的改革

根据学科特点与教学实践 ,主张大胆删节与前设课程重复的内容 ,引进趋近科学前沿的新知识以优化教学内容 ,并强调引入新知识应符合科学发展规律 ;利用现代化教学手段自制小课件及开展课堂讨论 ,能够有效地提高教学效果     

区域的土地利用与生态安全及可持续发展的分析

分析了区域土地利用与区域经济发展的相互作用关系,以及土地利用方式转变所产生的生态安全问题,分析表明:随着经济的发展,土地利用的结构、效率、集约程度也将发生深刻的变化,单位土地的占用必将带来的GDP的快速增长,然而土地利用／覆盖变化对气候、水文、生物多样性等产生重要的影响。借鉴深圳市20多年来土地利用变化以及土地利用方式转变所产生的生态安全问题,提出了在保障区域生态安全的前提下,实现经济可持续发展和土地可持续利用的战略措施体系。     

Computational analysis of MMAP[K]/PH[K]/1 queues with a mixed FCFS and LCFS service discipline

This paper studies a queueing system with a Markov arrival process with marked arrivals and PH‐distribution service times for each type of customer. Customers (regardless of their types) are served on a mixed first‐come‐first‐served (FCFS) and last‐come‐first‐served (LCFS) nonpreemptive basis. That is, when the queue length is N (a positive integer) or less, customers are served on an FCFS basis; otherwise, customers are served on an LCFS basis. The focus is on the stationary distribution of queue strings, busy periods, and waiting times of individual types of customers. A computational approach is developed for computing the stationary distribution of queue strings, the mean of busy period, and the means and variances of waiting times. The relationship between these performance measures and the threshold number N is analyzed in depth numerically. It is found that the variance of the virtual (actual) waiting time of an arbitrary customer can be reduced by increasing N. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 399–421, 2000     

一种由分抗干扰效果推出合成抗干扰效果的方法

提出了一种在外场雷达对抗试验中,由多部具有分抗干扰措施的雷达的抗干扰效果推出某种具有综合性抗干扰措施的雷达的合成抗干扰效果的方法,以在不具备该种雷达的情况下,用多部具有分抗干扰措施的雷达来代替它作为被干扰对象,在外场进行干扰机对其干扰的干扰效果试验检验。     

Determining a threshold control policy for an imperfect production system with rework jobs

Consider a threshold control policy for an imperfect production system with only a work center handling both regular and rework jobs. An imperfect production system studied here, generates defect jobs by factors other than machine failures. A threshold control or (ω, s) policy sets the guideline for a work center to switch between regular and rework jobs. A production cycle begins with loading and processing of several batches of regular jobs with a lot size equal to s. The outcome of each completed regular job is an independent Bernoulli trial with three possibilities: good, rework, or scrap. Once the work center accumulates more than a threshold ω of rework jobs, it finishes the last batch of regular jobs and switches to rework jobs. The objective of this research is to find a threshold ω and a lot size s that maximize the average long‐term profit. The ultimate goal is to construct a simple algorithm to search for ω and s that can be implemented directly in production management systems, as a result of this work. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 273–301, 1999     

Minimizing weighted earliness and tardiness penalties in single‐machine scheduling with idle time permitted

In this paper, a single‐machine scheduling problem with weighted earliness and tardiness penalties is considered. Idle time between two adjacent jobs is permitted and due dates of jobs could be unequal. The dominance rules are utilized to develop a relationship matrix, which allows a branch‐and‐bound algorithm to eliminate a high percentage of infeasible solutions. After combining this matrix with a branching strategy, a procedure to solve the problem is proposed. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 760–780, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10039     

Sojourn times in G/M/1 fork‐join networks

We consider a processing network in which jobs arrive at a fork‐node according to a renewal process. Each job requires the completion of m tasks, which are instantaneously assigned by the fork‐node to m task‐processing nodes that operate like G/M/1 queueing stations. The job is completed when all of its m tasks are finished. The sojourn time (or response time) of a job in this G/M/1 fork‐join network is the total time it takes to complete the m tasks. Our main result is a closed‐form approximation of the sojourn‐time distribution of a job that arrives in equilibrium. This is obtained by the use of bounds, properties of D/M/1 and M/M/1 fork‐join networks, and exploratory simulations. Statistical tests show that our approximation distributions are good fits for the sojourn‐time distributions obtained from simulations. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008